Improving Multigrid and Conventional Relaxation Algorithms for Propagators

نویسنده

  • Thomas Kalkreuter
چکیده

Practical modifications of deterministic multigrid and conventional relaxation algorithms are discussed. New parameters need not be tuned but are determined by the algorithms themselves. One modification can be thought of as “updating on a last layer consisting of a single site”. It eliminates critical slowing down in computations of bosonic and fermionic propagators in a fixed volume. Here critical slowing down means divergence of asymptotic relaxation times as the propagators approach criticality. A remaining volume dependence is weak enough in case of bosons so that conjugate gradient can be outperformed. However, no answer can be given yet if the same is true for staggered fermions on lattices of realizable sizes. Numerical results are presented for propagators of bosons and of staggered fermions in 4-dimensional SU(2) gauge fields. ∗Work supported by Deutsche Forschungsgemeinschaft. ∗∗E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cache-Efficient Multigrid Algorithms

Multigrid is widely used as an efficient solver for sparse linear systems arising from the discretization of elliptic boundary value problems. Linear relaxation methods like Gauss-Seidel and Red-Black Gauss-Seidel form the principal computational component of multigrid, and thus affect its efficiency. In the context of multigrid, these iterative solvers are executed for a small number of iterat...

متن کامل

Mapping Robust Parallel Multigrid Algorithms

SUMMARY The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite diicult to map eeectively to highly parallel architectures. Newer multigrid algorith...

متن کامل

Multigrid for propagators of staggered fermions in four-dimensional SU(2) gauge fields

Multigrid (MG) methods for the computation of propagators of staggered fermions in non-Abelian gauge fields are discussed. MG could work in principle in arbitrarily disordered systems. The practical variational MGmethods tested so far with a “Laplacian choice” for the restriction operator are not competitive with the conjugate gradient algorithm on lattices up to 18. Numerical results are prese...

متن کامل

ar X iv : h ep - l at / 9 41 10 54 v 1 2 5 N ov 1 99 4 1 ISU — Multigrid for computing propagators

The Iteratively Smoothing Unigrid algorithm (ISU), a new multigrid method for computing propagators in Lattice Gauge Theory, is explained. The main idea is to compute good (i.e. smooth) interpolation operators in an iterative way. This method shows no critical slowing down for the 2-dimensional Laplace equation in an SU(2) gauge field. First results for the Dirac-operator are also shown. 1. The...

متن کامل

Efficient Algorithms for High-Order Discretizations of the Euler and Navier-Stokes Equations

Higher order discretizations have not been widely successful in industrial applications to compressible flow simulation. Among several reasons for this, one may identify the lack of tailor-suited, best-practice relaxation techniques that compare favorably to highly tuned lower order methods, such as finite-volume schemes. In this paper we investigate efficient Spectral Difference discretization...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992